Long cycles in 3-cyclable graphs
نویسندگان
چکیده
It is proven that if G is a 3-cyclable graph on n vertices, with minimum degree δ and with a maximum independent set of cardinality α, then G contains a cycle of length at least min{n, 3δ− 3, n+ δ − α}.
منابع مشابه
Disjoint cycles in hypercubes with prescribed vertices in each cycle
A graph G is spanning r-cyclable of order t if for any r nonempty mutually disjoint vertex subsets A1, A2, . . . , Ar of G with |A1 ∪ A2 ∪ · · · ∪ Ar | ≤ t , there exist r disjoint cycles C1, C2, . . . , Cr of G such that C1 ∪ C2 ∪ · · · ∪ Cr spans G, and Ci contains Ai for every i. In this paper, we prove that the n-dimensional hypercube Qn is spanning 2-cyclable of order n − 1 for n ≥ 3. More...
متن کاملCycles through subsets with large degree sums
Let G be a 2-connected graph on n vertices and let X C__ V(G). We say that G is X-cyclable if G has an X-cycle, i.e., a cycle containing all vertices of X. We denote by ~(X) the maximum number of pairwise nonadjacent vertices in the subgraph G[X] of G induced by X. If G[X] is not complete, we denote by ~(X) the minimum cardinality of a set of vertices of G separating two vertices of X. By 6(X) ...
متن کاملVertex Removable Cycles of Graphs and Digraphs
In this paper we defined the vertex removable cycle in respect of the following, if $F$ is a class of graphs(digraphs) satisfying certain property, $G in F $, the cycle $C$ in $G$ is called vertex removable if $G-V(C)in in F $. The vertex removable cycles of eulerian graphs are studied. We also characterize the edge removable cycles of regular graphs(digraphs).
متن کاملCycles Through 23 Vertices in 3-Connected Cubic Planar Graphs
We establish that if A is a set of at most 23 vertices in a 3-connected cubic planar graph G, then there is a cycle in G containing A. This result is sharp. AMS Classification: 05C38 Let G be a 3-connected cubic planar graph and let A ⊆ V (G). It was shown in [4] that if |A| ≤ 19 there is a cycle C in G such that A ⊆ V (C). In this paper we show that if |A| ≤ 23, then G contains a cycle through...
متن کاملNeighborhood unions and cyclability of graphs
A graph G is said to be cyclable if for each orientation → G of G, there exists a set S of vertices such that reversing all the arcs of → G with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n¿ 36. In this paper, we show that if for any three independent vertices x1, x2 and x3, |N (x1) ∪ N (x2)|+ |N (x2) ∪ N (x3)|+ |N (x3) ∪ N (x1)|¿ 2n+ 1, then G is cycla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 218 شماره
صفحات -
تاریخ انتشار 2000